Encoding HTN Planning as a Dynamic CSP
نویسندگان
چکیده
Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal is an application of the CSP formalism on hierarchical task network planning domain. An encoding of HTN planning problems as a dynamic CSP is presented. We suppose that such encoding would provide a way for search space reduction through constraint propagation. The paper also deals with a search strategy and constraint combination suitable for the model.
منابع مشابه
Encoding HTN Planning in Propositional Logic
Casting planning problems as propositional satlsfiability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the benefits of this approach have only been utUized in primitive action-based planning models. Motivated by the conventional wisdom in the planning community about the effectiveness of hierarchical task network (HTN) planning models, in this...
متن کاملSolving Planning-Graph by Compiling It into CSP
Although the deep affinity between Graphplan’s backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily used to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automatically converting Graphplan’s planning graph into a CSP...
متن کاملA tool-supported approach to engineering HTN planning models
Our research concerns formal, expressive, objectcentred languages and tools for use in engineering domains for planning applications. In this paper we extend our recent work on an object-centred language for encoding precondition planning domains to a language called OCLh, designed for HTN planning. Domain encodings for HTN planners are particularly troublesome, because they tend to be used in ...
متن کاملPlanning As CSP : A Transition Based Encoding
Domain independent automated planning is hard. It has been shown that classical planning is PSPACE complete (Bylander 1994). But the bounded planning problem is in NP. Here bounded means restricting the planning problem by some means, such as plan length (number of actions in the solution) or the number of time steps (makespan). Kautz and Selman (1992) were the first to describe a polynomial re...
متن کاملOn Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, pp. 75-82.) Recent advances in constraint satisfaction and heuristic search have made it possible to solve classical planning problems significantly faster. There is an increasing amount of work on extending these advanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005